Topological dynamics of one-dimensional cellular automata
نویسنده
چکیده
1 Glossary Almost equicontinuous CA has an equicontinuous configuration. Attractor: omega-limit of a clopen invariant set. Blocking word interrupts information flow. Closing CA: distinct asymptotic configurations have distinct images. Column subshift: columns in space-time diagrams. Cross section: one-sided inverse map. ∗Université de Nice Sophia Antipolis, Département d’Informatique, Parc Valrose, F-06108 Nice Cedex 2, France & Center for Theoretical Study, Academy of Sciences and Charles University in Prague, Jilská 1, CZ-11000 Praha 1, Czechia
منابع مشابه
Transitivity and Chaoticity in 1-D Cellular Automata
Recent progress in symbolic dynamics of cellular automata (CA) shows that many CA exhibit rich and complicated Bernoulli-shift properties, such as positive topological entropy, topological transitivity and even mixing. Noticeably, some CA are only transitive, but not mixing on their subsystems. Yet, for one-dimensional CA, this paper proves that not only the shift transitivity guarantees the CA...
متن کاملAdditive Cellular Automata and Volume Growth
A class of dynamical systems associated to rings of S–integers in rational function fields is described. General results about these systems give a rather complete description of the well–known dynamics in one–dimensional additive cellular automata with prime alphabet, including simple formulæ for the topological entropy and the number of periodic configurations. For these systems the periodic ...
متن کاملEntropy rate of higher-dimensional cellular automata
We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift–commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the entropy rate result from basic results about the entropy of partitions of multidimensional cellular automata. We prove several results that show that entropy ...
متن کاملOn the Quantitative Behavior of the Linear Cellular Automata
In this paper, we study the quantitative behavior of one-dimensional linear cellular automata Tf [−r,r], defined by local rule f(x−r, . . . , xr) = r ∑ i=−r λixi (mod m), acting on the space of all doubly infinite sequences with values in a finite ring Zm, m ≥ 2. Once generalize the formulas given by Ban et al. [J. Cellular Automata 6 (2011) 385-397] for measure-theoretic entropy and topologica...
متن کاملOn Computing the Entropy of Cellular Automata
We study the topological entropy of a particular class of dynamical systems: cellular automata. The topological entropy of a dynamical system (X; F) is a measure of the complexity of the dynamics of F over the space X . The problem of computing (or even approximating) the topological entropy of a given cellular automata is algorithmically undecidable (Ergodic Theory Dynamical Systems 12 (1992) ...
متن کاملConjugacy of One-Dimensional One-Sided Cellular Automata is Undecidable
Two cellular automata are strongly conjugate if there exists a shiftcommuting conjugacy between them. We prove that the following two sets of pairs (F,G) of one-dimensional one-sided cellular automata over a full shift are recursively inseparable: (i) pairs where F has strictly larger topological entropy than G, and (ii) pairs that are strongly conjugate and have zero topological entropy. Becau...
متن کامل